MICA: A Probabilistic Dependency Parser Based on Tree Insertion Grammars (Application Note)
نویسندگان
چکیده
MICA is a dependency parser which returns deep dependency representations, is fast, has state-of-the-art performance, and is freely available.
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملMachine Translation Using Probabilistic Synchronous Dependency Insertion Grammars
Syntax-based statistical machine translation (MT) aims at applying statistical models to structured data. In this paper, we present a syntax-based statistical machine translation system based on a probabilistic synchronous dependency insertion grammar. Synchronous dependency insertion grammars are a version of synchronous grammars defined on dependency trees. We first introduce our approach to ...
متن کاملExploring the Spinal-Tig Model for Parsing French
We evaluate statistical parsing of French using two probabilistic models derived from the Tree Adjoining Grammar framework: a Stochastic Tree Insertion Grammar model (STIG) and a specific instance of this formalism, called Spinal Tree Insertion Grammar model which exhibits interesting properties with regard to data sparseness issues common to small treebanks such as the Paris 7 French Treebank....
متن کاملExploring the Spinal-STIG Model for Parsing French
We evaluate statistical parsing of French using two probabilistic models derived from the Tree Adjoining Grammar framework: a Stochastic Tree Insertion Grammar model (STIG) and a specific instance of this formalism, called Spinal Tree Insertion Grammar model which exhibits interesting properties with regard to data sparseness issues common to small treebanks such as the Paris 7 French Treebank....
متن کاملAnálisis ascendente bidireccional de TAG dirigido por el núcleo TIG
We define a bidireccional bottom-up parser for Tree Adjoining Grammars (TAG). This parser is a mixture of a defined bidireccional bottom-up parser for TAG and a new parser for Tree Insertion Grammars (TIG) that we present here. We show that the new mixed parser for TAG presents a significative reduction of the theoretical complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009